Tree structured sparse coding on cubes

نویسنده

  • Arthur Szlam
چکیده

Several recent works have discussed tree structured sparse coding [8, 10, 7, 3], where N data points in R written as the d × N matrix X are approximately decomposed into the product of matrices WZ . HereW is a d×K dictionary matrix, and Z is a K×N matrix of coefficients. In tree structured sparse coding, the rows of Z correspond to nodes on a tree, and the columns of Z are encouraged to be nonzero on only a few branches of the tree; or alternatively, the columns are constrained to lie on at most a specified number of branches of the tree.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Approximations to Structured Sparse Coding and Applications to Object Classification

We describe a method for fast approximation of sparse coding. The input space is subdivided by a binary decision tree, and we simultaneously learn a dictionary and assignment of allowed dictionary elements for each leaf of the tree. We store a lookup table with the assignments and the pseudoinverses for each node, allowing for very fast inference. In the process of describing this algorithm, we...

متن کامل

A Structured Dictionary Learning Method for Multi-scale Sparse Representation

In this paper, we address the problem of learning multi-scale sparse representations of natural images using structured dictionaries. Dictionaries learned by traditional algorithms have two major limitations: lack of structure and fixed size. These methods treat atoms independently from each other, and do not exploit possible relationships between them. Fixed size of atoms restricts the flexibi...

متن کامل

Structured sparse coding via lateral inhibition

This work describes a conceptually simple method for structured sparse coding and dictionary design. Supposing a dictionary with K atoms, we introduce a structure as a set of penalties or interactions between every pair of atoms. We describe modifications of standard sparse coding algorithms for inference in this setting, and describe experiments showing that these algorithms are efficient. We ...

متن کامل

Face Recognition using an Affine Sparse Coding approach

Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hen...

متن کامل

An Application of Tree-Structured Expectation Propagation for Channel Decoding

We show an application of a tree structure for approximate inference in graphical models using the expectation propagation algorithm. These approximations are typically used over graphs with short-range cycles. We demonstrate that these approximations also help in sparse graphs with long-range loops, as the ones used in coding theory to approach channel capacity. For asymptotically large sparse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1301.3590  شماره 

صفحات  -

تاریخ انتشار 2013